A Simplified Algorithm for the Topological Entropy of Multimodal Maps
نویسندگان
چکیده
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore, it simplifies a previous algorithm, also based on min-max symbols, which was originally proposed for twice differentiable multimodal maps. The new algorithm has been benchmarked against the old one with a number of multimodal maps, the results being reported in the paper. The comparison is favorable to the new algorithm, except in the unimodal case.
منابع مشابه
Computing the Topological Entropy of Multimodal Maps via Min-Max Sequences
We derive an algorithm to recursively determine the lap number (minimal number of monotonicity segments) of the iterates of twice differentiable l-modal map, enabling to numerically calculate the topological entropy of these maps. The algorithm is obtained by the min-max sequences—symbolic sequences that encode qualitative information about all the local extrema of iterated maps.
متن کاملEntropy of a semigroup of maps from a set-valued view
In this paper, we introduce a new entropy-like invariant, named Hausdorff metric entropy, for finitely generated semigroups acting on compact metric spaces from a set-valued view and study its properties. We establish the relation between Hausdorff metric entropy and topological entropy of a semigroup defined by Bis. Some examples with positive or zero Hausdorff metric entropy are given. Moreov...
متن کاملEntropy Estimate for Maps on Forests
A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...
متن کاملM ay 2 00 9 Monotonicity of entropy for real multimodal maps ∗
In [16], Milnor posed the Monotonicity Conjecture that the set of parameters within a family of real multimodal polynomial interval maps, for which the topological entropy is constant, is connected. This conjecture was proved for quadratic by Milnor & Thurston [17] and for cubic maps by Milnor & Tresser, see [18] and also [5]. In this paper we will prove the general case.
متن کاملMultimodal medical image fusion based on Yager’s intuitionistic fuzzy sets
The objective of image fusion for medical images is to combine multiple images obtained from various sources into a single image suitable for better diagnosis. Most of the state-of-the-art image fusing technique is based on nonfuzzy sets, and the fused image so obtained lags with complementary information. Intuitionistic fuzzy sets (IFS) are determined to be more suitable for civilian, and medi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Entropy
دوره 16 شماره
صفحات -
تاریخ انتشار 2014